Hierarchical Timed Automata for UPPAAL
نویسندگان
چکیده
منابع مشابه
From HUppaal to Uppaal: Vanilla-1
We present a hierarchical version of timed automata, equipped with data types, hand-shake synchronization, and local variables. We describe the formal semantics of this hierarchical timed automata (HTA) formalism in terms of a transition system. We report on the implementation of a flattening algorithm, that translates our formalism to a network of Uppaal timed automata. We establish a correspo...
متن کاملHierarchical Scheduling Framework Based on Compositional Analysis Using Uppaal
This paper introduces a reconfigurable compositional scheduling framework, in which the hierarchical structure, the scheduling policies, the concrete task behavior and the shared resources can all be reconfigured. The behavior of each periodic preemptive task is given as a list of timed actions, which are some of the inputs for the parameterized timed automata that make up the framework. Compon...
متن کاملCompositional Schedulability Analysis of An Avionics System Using UPPAAL
We propose a compositional framework for analyzing the schedulability of hierarchical scheduling systems. The framework is realized using Parameterized Stopwatch Automata to describe tasks, whereas the schedulability analysis is performed using UPPAAL. The concrete behavior of each periodic preemptive task is given as a list of timed actions to which resources are assigned by SIRAP protocol. Ou...
متن کاملVerification and Performance Analysis of Embedded and Cyber-Physical Systems using UPPAAL
Timed automata, priced timed automata and energy automata have emerged as useful formalisms for modeling a real-time and energy-aware systems as found in several embedded and cyber-physical systems. Whereas the real-time model checker UPPAAL allows for efficient verification of hard timing constraints of timed automata, model checking of priced timed automata and energy automata are in general ...
متن کاملComputer Science at Kent Verification of Timed Automata with Deadlines in Uppaal
Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more naturalrepresentation of urgent actions, with the additional advantage of avoiding the most common form oftimelocks. We offer a compositional translation of a practically useful subset of TAD to timed safetyautomata (the well-known variant of timed automata where time progress conditions are expre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999